Efficient Robust Private Set Intersection
نویسندگان
چکیده
Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustness, namely, coping with potentially arbitrarily misbehaving (i.e., malicious) parties, while retaining protocol efficiency (rather than employing costly generic techniques) is an open problem. In this work the first solution to this problem is
منابع مشابه
On the Security of O-PSI a Delegated Private Set Intersection on Outsourced Datasets (Extended Version)
In recent years, determining the common information privately and efficiently between two mutually mistrusting parties have become an important issue in social networks. Many Private set intersection (PSI) protocols have been introduced to address this issue. By applying these protocols, two parties can compute the intersection between their sets without disclosing any information about compone...
متن کاملPrivate Two-Party Set Intersection Protocol in Rational Model
Many data mining algorithms use privacy preserving set intersection operations. Private set operations have considered semi-honest and malicious adversarial models in cryptographic settings. Protocols in semi-honest model, requiring light computations, provide weak security. Protocols in malicious model guarantee strong security at the price of expensive computations like homomorphic encryption...
متن کاملPrivate and threshold set-intersection
In this paper we consider the problem of privately computing the intersection of sets (setintersection), as well as several variations on this problem: cardinality set-intersection, threshold set-intersection, and over-threshold set-intersection. Cardinality set-intersection is the problem of determining the size of the intersection set, without revealing the actual threshold set. In threshold ...
متن کاملPrivate and Threshold Set-Intersection
In this paper we consider the problem of privately computing the set-intersection (private matching) of sets, as well as several variations on this problem: cardinality set-intersection, threshold set-intersection, and over-threshold set-intersection. Cardinality set-intersection is the problem of determining the size of the intersection set, without revealing the actual set. In threshold set-i...
متن کاملPrivate Projections & Variants
There are many realistic settings where two mutually suspicious parties need to share some specific information while keeping everything else private. Various privacy-preserving techniques (such as Private Set Intersection) have been proposed as general solutions. Based on timely real-world examples, this paper motivates the need for a new privacy tool, called Private Set Intersection with Proj...
متن کامل